Laurier Flow

© 2024 LaurierFlow. All rights reserved.

AboutPrivacy

CP 264

Data Structures II

100%Liked

Easy

60%

Useful

100%

1 ratings

A continuation of the study of data structures and their applications using C. Linked lists, binary search trees, balanced search trees. Hashing, collision-avoidance strategies. Data structures for graphs and elementary graph algorithms. A continuation of basic algorithm analysis. Prerequisites: CP164 or CP114. Exclusions: CP217.

A continuation of the study of data structures and their applications using C. Linked lists, binary search trees, balanced search trees. Hashing, collision-avoidance strategies. Data structures for graphs and elementary graph algorithms. A continuation of basic algorithm analysis. Prerequisites: CP164 or CP114. Exclusions: CP217.

100%Liked

Easy

60%

Useful

100%

1 ratings

A continuation of the study of data structures and their applications using C. Linked lists, binary search trees, balanced search trees. Hashing, collision-avoidance strategies. Data structures for graphs and elementary graph algorithms. A continuation of basic algorithm analysis. Prerequisites: CP164 or CP114. Exclusions: CP217.

CP 264

Data Structures II

100%Liked

Easy

60%

Useful

100%

1 ratings

A continuation of the study of data structures and their applications using C. Linked lists, binary search trees, balanced search trees. Hashing, collision-avoidance strategies. Data structures for graphs and elementary graph algorithms. A continuation of basic algorithm analysis. Prerequisites: CP164 or CP114. Exclusions: CP217.

A continuation of the study of data structures and their applications using C. Linked lists, binary search trees, balanced search trees. Hashing, collision-avoidance strategies. Data structures for graphs and elementary graph algorithms. A continuation of basic algorithm analysis. Prerequisites: CP164 or CP114. Exclusions: CP217.

100%Liked

Easy

60%

Useful

100%

1 ratings

A continuation of the study of data structures and their applications using C. Linked lists, binary search trees, balanced search trees. Hashing, collision-avoidance strategies. Data structures for graphs and elementary graph algorithms. A continuation of basic algorithm analysis. Prerequisites: CP164 or CP114. Exclusions: CP217.

Course Reviews

It's a hard course, but the midterm and final are very fair, and the concepts are soo important to learn!!

Easy

Useful

Liked

— Business Administration (BBA) + Computer Science (BSc) student, taught by Hongbing Fan

CP 264 Prerequisites

CP 164 (Min. Grade D-) or CP 114 (Min. Grade D-)

CP 264 Leads To

CP 312, CP 317, CP 367, CP 372, CP 373, CP 386, CP 431, CP 471, CP 472, CP 411, CP 460

CP 264 Restrictions

Must be enrolled in one of the following Levels:

Undergraduate (UG)

Must be enrolled in one of the following Majors:

Computer Science (CPSC)

Data Science (DASC)

Cannot be enrolled in one of the following Year Levels:

Year 1 (1)

Course Schedule